#include "BinaryTree.h"

int main()
{
	char s[100] = { "ABD##E#H##CF##G##" };
	int i = 0;
	BTNode* root = CreateBTNode(s, &i);
	PrevOrder(root);
	printf("\n");
	InOrder(root);
	printf("\n");
	PostOrder(root);
	printf("\n");
	LevelOrder(root);

	printf("BinaryTreeHeight=%d\n", BTreeHeight(root));
	printf("BinaryTreeSize=%d\n", BTreeSize(root));
	printf("BinaryTreeLeafSize=%d\n", BTreeLeafSize(root));
	printf("BinaryTreeLevelKSize=%d\n", BTreeLevelKSize(root, 3));
	

	BTNode* findPos = BTreeFind(root, 'A');
	if (findPos == NULL)
	{
		printf("NULL");
	}
	else
	{
		printf("%d\n", findPos->data);
	}
	printf("BinaryTreeComplete=%d\n", BTreeComplete(root));

	BTreeDestroy(root);
	return 0;
}